Functions that have Read-Twice Constant Width Branching Programs are not Necessarily Testable
نویسندگان
چکیده
We construct a property on 0/1-strings that has a representation by a collection of width 3, read-twice oblivious branching programs, but for which any 2-sided -testing algorithm must make at least (n1=10) many queries for some fixed small enough . This shows that Newman’s result [15] cannot be generalized to read-k-times functions for k > 1.
منابع مشابه
Testing of Functions that have small width Branching Programs
Combinatorial property testing, initiated formally by Goldreich, Goldwasser and Ron in [11], and inspired by Rubinfeld and Sudan [13], deals with the following relaxation of decision problems: Given a fixed property and an input x, one wants to decide whether x has the property or is being ’far’ from having the property. The main result here is that if G = fg : f0; 1gn ! f0; 1gg is a family of ...
متن کاملTesting Membership in Languages that Have Small Width Branching Programs
Combinatorial property testing, initiated formally by Goldreich, Goldwasser, and Ron in [J. ACM, 45 (1998), pp. 653–750] and inspired by Rubinfeld and Sudan [SIAM J. Comput., 25 (1996), pp. 252–271], deals with the following relaxation of decision problems: Given a fixed property and an input x, one wants to decide whether x has the property or is “far” from having the property. The main result...
متن کاملOn the Hierarchies for Deterministic, Nondeterministic and Probabilistic Ordered Read-k-times Branching Programs
The paper examines hierarchies for nondeterministic and deterministic ordered read-k-times Branching programs. The currently known hierarchies for deterministic k-OBDD models of Branching programs for k = o(n1/2/ log n) are proved by B. Bollig, M. Sauerhoff, D. Sieling, and I. Wegener in 1998. Their lower bound technique was based on communication complexity approach. For nondeterministic k-OBD...
متن کاملTime-Space Tradeoffs for Branching Programs
We obtain the first non-trivial time-space tradeoff lower bound for functions f : {0, 1}n → {0, 1} on general branching programs by exhibiting a Boolean function f that requires exponential size to be computed by any branching program of length (1 + ǫ)n, for some constant ǫ > 0. We also give the first separation result between the syntactic and semantic read-k models [BRS93] for k > 1 by showin...
متن کاملPseudorandomness for Regular Branching Programs via Fourier Analysis
We present an explicit pseudorandom generator for oblivious, read-once, permutation branching programs of constant width that can read their input bits in any order. The seed length is O(log n), where n is the length of the branching program. The previous best seed length known for this model was n, which follows as a special case of a generator due to Impagliazzo, Meka, and Zuckerman (FOCS 201...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Random Struct. Algorithms
دوره 24 شماره
صفحات -
تاریخ انتشار 2002